Linear Independence and Choice
نویسندگان
چکیده
The notions of linear and metric independence are investigated in relation to the property: if U is a set of m + 1 independent vectors, and X is a set of m independent vectors, then adjoining some vector in U to X results in a set of m + 1 independent vectors. A weak countable choice axiom is introduced, in the presence of which linear and metric independence are equivalent. Proofs are carried out in the context of intuitionistic logic.
منابع مشابه
A Weak Countable Choice Principle
A weak choice principle is introduced that is implied both by countable choice and by the law of excluded middle. This principle su ces to prove that metric independence is the same as linear independence in an arbitrary normed space over a locally compact eld, and to prove the fundamental theorem of algebra. 1 Bishop's principle Without appeal to the law of excluded middle, Bishop [1, Lemma 7,...
متن کاملAverage choice
This is an investigation of stochastic choice when only the average of the choices is observable. For example when one observes aggregate sales numbers from a store, but not the frequency with which each item was purchased. The focus of our work is on the Luce model, also known as the Logit model. We show that a simple path independence property of average choice uniquely characterizes the Luce...
متن کاملMechanism design with two alternatives in quasi-linear environments
We study mechanism design in quasi-linear private values environments when there are two alternatives. We show that under a mild range condition, every implementable allocation rule is a generalized utility function maximizer. In unbounded domains, if we replace our range condition by an independence condition, then every implementable allocation rule is an affine maximizer. Our results extend ...
متن کاملLinear Independence of Cluster Monomials for Skew-symmetric Cluster Algebras
Fomin-Zelevinsky conjectured that in any cluster algebra, the cluster monomials are linearly independent and that the exchange graph is independent of the choice of coefficients. We confirm these conjectures for all skew-symmetric cluster algebras.
متن کاملFuzzy Independence and Extended Conditional Probability
In many applications, the use of Bayesian probability theory is problematical. Information needed to feasibility calculate is unavailable. There are different method-ologies for dealing with this problem, e.g., maximal entropy and Dempster-Shafer Theory. If one can make independence assumptions, many of the problems disappear, and in fact, this is often the method of choice even when it is obvi...
متن کامل